Average-sense optimality and competitive optimality for almost instantaneous VF codes
نویسندگان
چکیده
One-shot coding and repeated coding are considered for the class of almost instantaneous variable-to-fixed length (AIVF) codes, AIVF, which includes some nonproper VF codes in addition to the class of proper VF codes, PVF. An algorithm is given to construct the average-sense optimal (a-optimal) AIVF code in one-shot coding that attains the maximum average parse length in AIVF. The algorithm can also be used to obtain an AIVF code with multiple parse trees, which can attain good performance for repeated coding. Generally, the a-optimal code for one-shot coding and the good code for repeated coding are more efficient than the Tunstall code in -ary cases if 3 although they coincide with the Tunstall code in the binary case. The competitively optimal (c-optimal) VF code is also considered for one-shot coding, and it is shown that the c-optimal code does not always exist in PVF and in AIVF. Furthermore, whenever the c-optimal code exists, the Tunstall code is c-optimal in PVF and the a-optimal code obtained by our algorithm is c-optimal in AIVF if = 2 or 3, but the a-optimal code is not always c-optimal in AIVF if 4.
منابع مشابه
Dynamic Optimality - Almost
We present an O(lg lgn)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lgn). This is the first major progress on Sleator and Tarjan’s dynamic optimality conjecture of 1985 that O(1)-competitive binary search trees exist.
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملOptimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone
In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.
متن کاملSufficient global optimality conditions for general mixed integer nonlinear programming problems
In this paper, some KKT type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (MINPP) are established. We achieve this by employing a Lagrange function for MINPP. In addition, verifiable sufficient global optimality conditions for general mixed integer quadratic programming problems are der...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 47 شماره
صفحات -
تاریخ انتشار 2001